Maximum cut on line and total graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs

Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.

متن کامل

N-extendability of Line Graphs, Power Graphs, and Total Graphs

A graph G that has a perfect matching is n-extendable if every matching of size n lies in a perfect matching of G. We show that when the connectivity of a line graph, power graph, or total graph is sufficiently large then it is n-extendable. Specifically: if G has even size and is (2n + 1)edge-connected or (n + 2)-connected, then its line graph is n-extendable; if G has even order and is (n + 1...

متن کامل

Computing the Minimum Cut and Maximum Flow of Undirected Graphs

This work presents an algorithm for computing the maximum flow and minimum cut of undirected graphs, based on the well-known algorithm presented by Ford and Fulkerson for directed graphs. The new algorithm is equivalent to just applying Ford and Fulkerson algorithm to the directed graph obtained from original graph but with two directed arcs for each edge in the graph, one in each way. We prese...

متن کامل

On Diameter of Line Graphs

The diameter of a connected graph $G$, denoted by $diam(G)$, is the maximum distance between any pair of vertices of $G$. Let $L(G)$ be the line graph of $G$. We establish necessary and sufficient conditions under which for a given integer $k geq 2$, $diam(L(G)) leq k$.

متن کامل

On total 9-coloring planar graphs of maximum degree seven

Given a graphG, a total k-coloring ofG is a simultaneous coloring of the vertices and edges ofGwith at most k colors. If ∆(G) is themaximum degree ofG, then no graph has a total ∆-coloring, but Vizing conjectured that every graph has a total (∆ + 2)-coloring. This Total Coloring Conjecture remains open even for planar graphs. This article proves one of the two remaining planar cases, showing th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1999

ISSN: 0166-218X

DOI: 10.1016/s0166-218x(99)00056-6